The Multiplicative Algebraic Reconstruction Technique Solves the Geometric Programming Problem
نویسنده
چکیده
The geometric programming problem (GP) is to minimize a posynomial g(t) = I ∑
منابع مشابه
RESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملA goal geometric programming problem (G2P2) with logarithmic deviational variables and its applications on two industrial problems
A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighte...
متن کاملGeometric Programming Problem with Trapezoidal Fuzzy Variables
Nowadays Geometric Programming (GP) problem is a very popular problem in many fields. Each type of Fuzzy Geometric Programming (FGP) problem has its own solution. Sometimes we need to use the ranking function to change some part of GP to the linear one. In this paper, first, we propose a method to solve multi-objective geometric programming problem with trapezoidal fuzzy variables; then we use ...
متن کاملA Geometric Approach to Quadratic Optimization in Computerized Tomography
The problem of image reconstruction from projections in computerized tomography, when cast as a system of linear equations, leads to an inconsistent system. The problem is studied under very adverse conditions, consisting of lowcontrast images and a strongly underdetermined system, where the number of equations is only about 25% of the number of variables (fewer equations enable the use of less...
متن کاملGraph Matching via Multiplicative Update Algorithm
As a fundamental problem in computer vision, graph matching problem can usually be formulated as a Quadratic Programming (QP) problem with doubly stochastic and discrete (integer) constraints. Since it is NP-hard, approximate algorithms are required. In this paper, we present a new algorithm, called Multiplicative Update Graph Matching (MPGM), that develops a multiplicative update technique to ...
متن کامل